LNCS 1372 - Attacking Triple Encryption
نویسنده
چکیده
The standard technique to attack triple encryption is the meet-in-the-middle attack which requires 2 encryption steps. In this paper, more efficient attacks are presented. One of our attacks reduces the overall number of steps to roughly 2. Other attacks optimize the number of encryptions at the cost of increasing the number of other operations. It is possible to break triple DES doing 2 single encryptions and no more than 2 faster operations.
منابع مشابه
Attacking Triple Encryption
The standard technique to attack triple encryption is the meet-in-the-middle attack. In this paper, more eecient attacks are presented. Compared to meet-in-the-middle, our attacks either greatly reduce the number of single encryptions to be done, or somewhat reduce the overall number of steps. Especially, about 2 108 steps of computation are suucient to break three-key triple DES. If one concen...
متن کاملMethods of attacking chaotic encryption and countermeasures
Methods of attacking chaotic encryption algorithms have been developed. These methods have been applied to all the published chaotic encryption systems and all these systems are broken in very short computer times. Counter measures have also been developed in order to make chaotic encryption secure. Several examples and results are given.
متن کاملMobile Agent Security
Mobile agent technology is a new paradigm of distributed computing that can replace the conventional client-server model. However, it has not become popular due to some problems such as security. Threats to mobile agent security generally fall into three main classes: disclosure of information, denial of service, and corruption of information. Four threat categories are identified: threats stem...
متن کاملTight Security Bounds for Triple Encryption
In this paper, we revisit the long-standing open problem asking the exact provable security of triple encryption in the ideal cipher model. For a blockcipher with key length κ and block size n, triple encryption is known to be provably secure up to 2 1 2 min{κ,n} queries, while the best attack requires 2κ+min{κ, n 2 } query complexity. So there has been a gap between the upper and lower bounds ...
متن کاملProvable Secure Generalized Signcryption
Generalized Signcryption is a new cryptographic primitive which can work as an encryption scheme, a signature scheme or a signcryption scheme. We give security notions of Generalized Signcryption and improve a Generalized Signcryption scheme proposed by Han et al.We give the formal attacking model of this new cryptographic primitive in the framework of theory of provable security. At last, we g...
متن کامل